A representation of exchangeable hierarchies by sampling from random real trees
نویسندگان
چکیده
منابع مشابه
Random Sampling from B+ Trees
We consider the design and analysis of algorithms to retrieve simple random samples from databases. Specifically, we examine simple random sampling from B+ tree files. Existing methods of sampling from B+ trees, require the use of auxiliary rank information in the nodes of the tree. Such modified B+ tree files are called “ranked B+ trees”. We compare sampling from ranked Bt tree files, with new...
متن کاملRestricted exchangeable partitions and embedding of associated hierarchies in continuum random trees
We introduce the notion of a restricted exchangeable partition of N. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In particular, we deduce from the general theory developed here a limit result conjectured previously for Ford’s alpha model and its extension, the alpha-gamma model, where restric...
متن کاملRepresentation theorems for partially exchangeable random variables
We provide representation theorems for both finite and countable sequences of finite-valued random variables that are considered to be partially exchangeable. In their most general form, our results are presented in terms of sets of desirable gambles, a very general framework for modelling uncertainty. Its key advantages are that it allows for imprecision, is more expressive than almost every o...
متن کاملRandom Sampling from Pseudo-Ranked B+ Trees
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The first approach requires the entire root-to-leaf path to be updated with each insertion and deletion. The second has no update overhead, but incurs a high rejection rate for the compressed-key B+ trees commonly used in prac...
متن کاملPerfect Sampling of Random Spanning Trees
Let G be a weighted directed graph where the edge weights are non-negative real numbers. An arborescence or (directed) spanning tree with root r is a connected subgraph of G such that there is a unique directed path from v to r for each v ∈ V (G). The weight of a spanning tree T will be the product of the weights of the edges of T . Let Υ(G) be the probability distribution on the set of all spa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2017
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s00440-017-0799-4